Conditioning continuous-time Markov processes by guiding

نویسندگان

چکیده

A continuous-time Markov process X can be conditioned to in a given state at fixed time T>0 using Doob's h-transform. This transform requires the typically intractable transition density of X. The effect h-transform described as introducing guiding force on process. Replacing this with an approximation defines wider class guided processes. For certain approximations law approximates – and is equivalent actual conditional distribution, tractable likelihood-ratio. main contribution paper prove that principle process, introduced [M. Schauer, F. van der Meulen, H. Zanten, Guided proposals for simulating multi-dimensional diffusion bridges, Bernoulli 23 (2017a), pp. 2917–2950. doi:10.3150/16-BEJ833] stochastic differential equations, extended more general In particular we apply technique jump processes discrete spaces. perspective enables us improve upon existing results hypo-elliptic diffusions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous time Markov decision processes

In this paper, we consider denumerable state continuous time Markov decision processes with (possibly unbounded) transition and cost rates under average criterion. We present a set of conditions and prove the existence of both average cost optimal stationary policies and a solution of the average optimality equation under the conditions. The results in this paper are applied to an admission con...

متن کامل

Solving Structured Continuous-Time Markov Decision Processes

We present an approach to solving structured continuous-time Markov decision processes. We approximate the the optimal value function by a compact linear form, resulting in a linear program. The main difficulty arises from the number of constraints that grow exponentially with the number of variables in the system. We exploit the representation of continuous-time Bayesian networks (CTBNs) to de...

متن کامل

Continuous Time Markov Processes on Graphs

We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we study “multi-person simple random walks” on a graph G with n vertices. There are n persons distributed randomly at the vertices of G. In each step of this di...

متن کامل

Series Expansions for Continuous-Time Markov Processes

We present update formulas that allow us to express the stationary distribution of a continuous-time Markov process with denumerable state space having generator matrix Q∗ through a continuous-time Markov process with generator matrix Q. Under suitable stability conditions, numerical approximations can be derived from the update formulas, and we show that the algorithms converge at a geometric ...

متن کامل

Tutorial on Structured Continuous-Time Markov Processes

A continuous-time Markov process (CTMP) is a collection of variables indexed by a continuous quantity, time. It obeys the Markov property that the distribution over a future variable is independent of past variables given the state at the present time. We introduce continuous-time Markov process representations and algorithms for filtering, smoothing, expected sufficient statistics calculations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastics An International Journal of Probability and Stochastic Processes

سال: 2022

ISSN: ['1744-2516', '1744-2508']

DOI: https://doi.org/10.1080/17442508.2022.2150081